Hamilton cycles in prisms
نویسندگان
چکیده
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. c © ??? John Wiley & Sons, Inc. Journal of Graph Theory Vol. ???, 1 20 (???) c © ??? John Wiley & Sons, Inc. CCC ??? 2 JOURNAL OF GRAPH THEORY
منابع مشابه
Hamilton cycles in prisms over graphs
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be a good measure how close a graph is to being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of hamiltonian prisms.
متن کاملOn the Number of Hamilton Cycles in Bounded Degree Graphs
The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs – deriving thereby extremal bounds. We describe an algorithm which enumerates all Hamilton cycles of a given 3-regular n-vertex graph in time O(1.276), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276) for the maximum number of Hamilton cycles in 3-regul...
متن کاملOn the Orchard crossing number of prisms, ladders and other related graphs
This paper deals with the Orchard crossing number of some families of graphs which are based on cycles. These include disjoint cycles, cycles which share a vertex and cycles which share an edge. Specifically, we focus on the prism and ladder graphs.
متن کاملMaximal sets of hamilton cycles in complete multipartite graphs
A set S of edge-disjoint hamilton cycles in a graph G is said to be maximal if the edges in the hamilton cycles in S induce a subgraph H of G such that G EðHÞ contains no hamilton cycles. In this context, the spectrum SðGÞ of a graph G is the set of integersm such that G contains a maximal set of m edge-disjoint hamilton cycles. This spectrum has
متن کاملAccretionary prisms in subduction earthquake cycles: The theory of dynamic Coulomb wedge
[1] We expand the theory of critically tapered Coulomb wedge for accretionary prisms by considering stress changes in subduction earthquake cycles. Building on the Coulomb plasticity of the classical theory, we assume an elastic–perfectly Coulomb plastic rheology and derive exact stress solutions for stable and critical wedges. The new theory postulates that the actively deforming, most seaward...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 56 شماره
صفحات -
تاریخ انتشار 2007